Necessary and sufficient fixed point critera involving attractors
نویسندگان
چکیده
منابع مشابه
A Fixed Point Theorem and Attractors
We investigate attractors for compact sets by considering a certain quotient space. The following theorem is included. Let /: G -> G, G a closed convex subset of a Banach space, / a mapping satisfying (i) there exists M c G which is an attractor for compact sets under/; (ii) the family {/"}Ü°_i is equicontinuous. Then/has a fixed point. 1. Since the appearance of the celebrated Schauder fixed p...
متن کاملNecessary and Sufficient Conditions for Fixed-Point Theorems, Minimax Inequalities and Related Theorems
This paper provides necessary and sufficient conditions for fixed-point theorems, minimax inequalities and some related theorems defined on arbitrary topological spaces that may be discrete, continuum, non-compact or non-convex. We establish a single condition, γ-recursive transfer lower semicontinuity, which fully characterizes the existence of equilibrium of minimax inequality without imposin...
متن کاملNecessary and Sufficient Condition for Mann Iteration Converges to a Fixed Point of Lipschitzian Mappings
Suppose that E is a real normed linear space, C is a nonempty convex subset of E, T : C → C is a Lipschitzian mapping, and x∗ ∈ C is a fixed point of T . For given x0 ∈ C, suppose that the sequence {xn} ⊂ C is the Mann iterative sequence defined by xn 1 1−αn xn αnTxn, n ≥ 0, where {αn} is a sequence in 0, 1 , ∑∞ n 0 α 2 n < ∞, ∑∞ n 0 αn ∞. We prove that the sequence {xn} strongly converges to x...
متن کاملA Complexity Assessment for Queries Involving Sufficient and Necessary Causes
In this work, we revisit a recently proposed multi-valued semantics for logic programs where each true atom in a stable model is associated with a set of expressions (or causal justifications) involving rule labels. For positive programs, these causal justifications correspond to the possible alternative proofs of the atom that further satisfy some kind of minimality or lack of redundancy. This...
متن کاملNecessary and sufficient conditions for exact floating point operations
Studying floating point arithmetic, authors have shown that the implemented operations (addition, subtraction, multiplication, division and square root) can compute a result and an exact correcting term using the same format as the inputs. Following a path initiated in 1965, all the authors supposed that neither underflow nor overflow occurred in the process. Overflow is not critical as some ki...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1993
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700015513